Pattern Avoidance in Ascent Sequences
نویسندگان
چکیده
Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and various other combinatorial structures. We study pattern avoidance in ascent sequences, giving several results for patterns of lengths up to 4, for Wilf equivalence and for growth rates. We establish bijective connections between pattern avoiding ascent sequences and various other combinatorial objects, in particular with set partitions. We also make a number of conjectures related to all of these aspects.
منابع مشابه
Ascent Sequences Avoiding Pairs of Patterns
Ascent sequences were introduced by Bousquet-Melou et al. in connection with (2+2)-avoiding posets and their pattern avoidance properties were first considered by Duncan and Steingŕımsson. In this paper, we consider ascent sequences of length n avoiding two patterns of length 3, and we determine an exact enumeration for 16 different pairs of patterns. Methods include simple recurrences, bijecti...
متن کاملSome enumerative results related to ascent sequences
An ascent sequence is a sequence consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets and a variety of other combinatorial structures. In this paper, we prove some recent conjectures of Duncan and Steingŕımsson concerning pattern avoid...
متن کاملAscent-Descent Young Diagrams and Pattern Avoidance in Alternating Permutations
We investigate pattern avoidance in alternating permutations and an alternating analogue of Young diagrams. In particular, using an extension of Babson and West’s notion of shape-Wilf equivalence described in our recent paper (with N. Gowravaram), we generalize results of Backelin, West, and Xin and Ouchterlony to alternating permutations. Unlike Ouchterlony and Bóna’s bijections, our bijection...
متن کاملAscent sequences and the binomial convolution of Catalan numbers
In this paper, we consider two sets of pattern-avoiding ascent sequences: those avoiding both 201 and 210 and those avoiding 0021. In each case we show that the number of such ascent sequences is given by the binomial convolution of the Catalan numbers. The result for {201, 210}-avoiders completes a family of results given by Baxter and the current author in a previous paper. The result for 002...
متن کاملUnlabeled (2+ 2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations
We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2 + 2)-free posets and a certain class of chord diagrams (or involutions), already appear in the literature. The third one is a class of permutations, defined in terms of a new type of pattern. An attractive property of these patterns is that, like classical patterns, they are closed under ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011